Bilevel Mixed Integer Transmission Expansion Planning
نویسندگان
چکیده
منابع مشابه
Transmission Expansion Planning: A Mixed-Integer LP Approach
This paper presents a mixed-integer LP approach to the solution of the long-term transmission expansion planning problem. In general, this problem is large-scale, mixed-integer, nonlinear, and nonconvex. We derive a mixed-integer linear formulation that considers losses and guarantees convergence to optimality using existing optimization software. The proposed model is applied to Garver’s 6-bus...
متن کاملA bilevel mixed-integer program for critical infrastructure protection planning
Vulnerability to sudden service disruptions due to deliberate sabotage and terrorist attacks is one of the major threats of today. In this paper, we present a bilevel formulation of the r-interdiction median problem with fortification (RIMF). RIMF identifies the most cost-effective way of allocating protective resources among the facilities of an existing but vulnerable system so that the impac...
متن کاملMixed-integer bilevel optimization for capacity planning with rational markets
We formulate the capacity expansion planning as a bilevel optimization to model the hier-archical decision structure involving industrial producers and consumers. The formulation isa mixed-integer bilevel linear program in which the upper level maximizes the profit of a pro-ducer and the lower level minimizes the cost paid by markets. The upper-level problem includesmixed-in...
متن کاملA Multi-objective Transmission Expansion Planning Strategy: A Bilevel Programming Method
This paper describes a methodology for transmission expansion planning (TEP) within a deregulated electricity market. Two objective functions including investment cost (IC) and congestion cost (CC) are considered. The proposed model forms a bi-level optimization problem in which upper level problem represents an independent system operator (ISO) making its decisions on investment while in the l...
متن کاملA Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs
We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present polynomial time algorithms for pure and mixed integer bilevel problems. For the mixed integer case where the leader’s variables are continuous, our algorithm also detects whether the infimum cost fail...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Power Systems
سال: 2018
ISSN: 0885-8950,1558-0679
DOI: 10.1109/tpwrs.2018.2865189